package com.kobe.game_20;

import com.kobe.util.MathUtil;

/**
 * 
 * By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see
 * that the 6th prime is 13.
 * 
 * What is the 10001 st prime number?
 * 
 * 
 * the Result is: 104743
 */
public class Game_7 {

    public static void main(String[] args) {
        int count = 6;
        int prime = 13;
        do {
            if (MathUtil.isPrime(prime += 2))
                count++;
        } while (count < 10001);
        System.out.println(prime);
    }

}
